Parsing of Context-Sensitive Languages
نویسنده
چکیده
This art icle presents some ideas from parsing Context-Sensit ive languages. Introduces Scattered-Context grammars and languages and describes usage of such grammars to parse CS languages. Also there are presented additional results fronr type checking and formal prograrn verification using CS parsing. I{eywords: Turing Machines, Parsing of Context-Sensitive Languages, Fornral Program Verification, Scattered-Context Grammars.
منابع مشابه
Top-Down Parsing with Parsing Contexts A Simple Approach to Context-Sensitive Parsing
The domain of context-free languages has been extensively explored and there exist numerous techniques for parsing (all or a subset of) context-free languages. Unfortunately, some programming languages are not context-free. Using standard context-free parsing techniques to parse a context-sensitive programming language poses a considerable challenge. Implementors of programming language parsers...
متن کاملApplying the Adaptive Agent Oriented Software Architecture to the Parsing of Context Sensitive Grammars
Adaptive Agent Oriented Software Architecture (AAOSA) is a new approach to software design based on an agent-oriented architecture. In this approach, agents are considered adaptively communicating concurrent modules that are divided into a “white box” module responsible for communications and learning and a “black box” which is responsible for the independent specialized processes. An AAOSA sys...
متن کاملDeterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended to Tree Adjoining Grammars (TAGs). We use a machine, called Bottom-up Embedtied Push Down Automaton (BEPDA), that recognizes in a bottom-up fashion the set of Tree Adjoining Languages (and exactly this se0. Each parser...
متن کاملPolynomial Pregroup Grammars parse Context Sensitive Languages
Pregroup grammars with a possibly infinite number of lexical entries are polynomial if the length of type assignments for sentences is a polynomial in the number of words. Polynomial pregroup grammars are shown to generate the standard mildly context sensitive formal languages as well as some context sensitive natural language fragments of Dutch, SwissGerman or Old Georgian. A polynomial recogn...
متن کاملLayout-Sensitive Generalized Parsing
The theory of context-free languages is well-understood and context-free parsers can be used as off-the-shelf tools in practice. In particular, to use a context-free parser framework, a user does not need to understand its internals but can specify a language declaratively as a grammar. However, many languages in practice are not context-free. One particularly important class of such languages ...
متن کامل